Improved ACO-Based Sweep Coverage Scheme Considering Data Delivery
نویسندگان
چکیده
منابع مشابه
Periodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem
We provide a sweep coverage algorithm for routing mobile sensors that communicate with a central data sink. This algorithm improves on its predecessors by reducing the number of unnecessary scans when different points of interest (POIs) have different requirements for the time interval within which they must be scanned (sweep period). Most sweep coverage algorithms seek to minimize the number o...
متن کاملA Sweep Coverage Scheme Based on Vehicle Routing Problem
As an emerging coverage problem in wireless sensor networks, sweep coverage which introducing mobile sensors to cover points of interest within certain time interval can satisfy monitoring request in some particular application scenarios with less number of nodes than the conventional static coverage approach. In this work, aiming to support dynamical POI coverage and data delivery simultaneous...
متن کاملAco-based Load Balancing Scheme for Manets
Original scientific paper Routing is one of the most important problems in Mobile Ad-hoc Networks (MANETs). Various techniques have been developed to cope with this problem. Ant-based routing is optimization technique used commonly. Ant-based routing is derived from ant colony optimization, which was inspired by ants. This article recommends a load balancing scheme based on the ant colony. The ...
متن کاملPoint Sweep Coverage on Path
An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically cover the set of PoIs. For PoIs in a Eulerian graph, this problem is known NP-Hard even if all sensors are with uniform velocity. In this paper, we study the pr...
متن کاملOptimal Line-sweep-based Decompositions for Coverage Algorithms
Robotic coverage is the problem of moving a sensor or actuator over all points in a given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. In this paper, we focus on generating decompos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2017
ISSN: 1726-4529
DOI: 10.2507/ijsimm16(2)9.385